An improved ant colony algorithm for TSP application
نویسندگان
چکیده
منابع مشابه
Application of Improved Ant Colony Algorithm in Solving TSP
Using ant colony algorithm to solve TSP (traveling salesman problem) has some disadvantages as easily plunging into local minimum, slow convergence speed and so on. In order to find the optimal path accurately and rapidly, an improved ant colony algorithm is proposed. Experimental results show that the improved ant colony algorithm has better effectiveness for TSP problems solutions.
متن کاملAn Improved Ant Colony Optimization Algorithm for Solving TSP
The basic ant colony optimization (ACO) algorithm takes on a longer computing time in the search process and is prone to fall into local optimal solutions, an improved ACO (CEULACO) algorithm is proposed in this paper. In the CEULAC algorithm, the direction guidance and real variable function are used to initialize pheromone concentration according to the path information of undirected graph. T...
متن کاملAn Ant Colony Optimization Algorithm for Network Vulnerability Analysis
Intruders often combine exploits against multiple vulnerabilities in order to break into the system. Each attack scenario is a sequence of exploits launched by an intruder that leads to an undesirable state such as access to a database, service disruption, etc. The collection of possible attack scenarios in a computer network can be represented by a directed graph, called network attack gra...
متن کاملOptimal Distributed Generation (DG) Allocation in Distribution Networks using an Improved Ant Colony Optimization (ACO) Algorithm
Abstract: The development of distributed generation (DGs) units in recent years have created challenges in the operation of power grids, especially distribution networks. One of these issues is the optimal allocation (location and capacity) of these units in distribution networks. In this thesis, a method based on the improved ant colony optimization algorithm is presented to solve the problem ...
متن کاملAn Improved Ant Colony Algorithm for Genome Rearrangements
Genome rearrangement is an important area in computational biology and bioinformatics. The basic problem in genome rearrangements is to compute the edit distance, i.e., the minimum number of operations needed to transform one genome into another. Unfortunately, unsigned genome rearrangement problem is NP-hard. In this study an improved ant colony optimization algorithm to approximate the edit d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics: Conference Series
سال: 2021
ISSN: 1742-6588,1742-6596
DOI: 10.1088/1742-6596/1802/3/032067